#include <cstdio>
const int maxn = 300;
int f[maxn][maxn], n, k;
int main()
{
	freopen("init.in", "r", stdin);
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= k; ++i)
		f[1][i] = 1;
	for (int j = 2; j <= k; ++j)
		for (int i = 1; i <= n; ++i)
			for (int k = 1; k <= i - 2; ++k)
			{
				f[i][j] += f[k][j - 1] * f[i - k - 1][j - 1];
				while (f[i][j] <= 0)
					f[i][j] += 9901;
				f[i][j] %= 9901;
			}
	printf("%d\n", (f[n][k] - f[n][k - 1] + 9901) % 9901);
	return 0;
}